Highly parallel approximations for inherently sequential problems
نویسنده
چکیده
In this work we study classes of optimization problems that require inherently sequential algorithms to solve exactly but permit highly parallel algorithms for approximation solutions. NC is the class of computational problems decidable by a logarithmic space uniform family of Boolean circuits of bounded fan-in, polynomial size, and polylogarithmic depth. Such problems are considered both “efficient” (since NC ⊆ P) and “highly parallel” (since we might consider each gate in the circuit to be a processor working in parallel and the small depth of the circuit a small number of steps). By contrast, problems which are P-complete (under logarithmic space or even NC many-one reductions) are considered “inherently sequential”. Furthermore, all NP-hard and PSPACE-hard problems are also inherently sequential, since P ⊆ NP ⊆ PSPACE. Just as we hope to find efficient approx mation algorithms for optimization problems for which it is intractable to compute an exact solution, so too do we hope to find efficient and highly parallel approximation algorithms for optimization problems for which computing the exact solution is inherently sequential. (However, just like hardness of approximation for NP-hard problems, in some cases even approximating a solution is inherently sequential!)
منابع مشابه
Parallelism with limited nondeterminism
Since parallel computing is again becoming a topic of interest in computer science, it is important to revisit the theoretical foundations of highly parallel computing. “Inherently sequential” computational problems see no significant speedup when run on highly parallel computers. Just as there are efficient approximations for intractable optimization problems, so too are there efficient and hi...
متن کاملBOSTON UNIVERSITY GRADUATE SCHOOL OF ARTS AND SCIENCES Dissertation PARALLELISM WITH LIMITED NONDETERMINISM
Computational complexity theory studies which computational problems can be solved with limited access to resources. The past fifty years have seen a focus on the relationship between intractable problems and efficient algorithms. However, the relationship between inherently sequential problems and highly parallel algorithms has not been as well studied. Are there efficient but inherently seque...
متن کاملStrict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best known sequential algorithm for L has polynomial speedup by parallelization, this implies that all problems in P have a polynomial speedup in the parallel setting. The motivation for defining this class of problems is to...
متن کاملRestricted probabilistically checkable proofs
In this work we provide some initial structural complexity results for classes of probabilistically checkable proof systems (PCPs) for nondeterministic NC (NNC) circuit families, as a first step towards characterizing probabilistic proof systems for P. One of the major successes of the characterization of NP as a class of PCPs (with polynomial time verifiers) is that it provides a route to prov...
متن کاملRunge-Kutta-Nyström-type parallel block predictor-corrector methods
This paper describes the construction of block predictor-corrector methods based on Runge-Kutta-Nystrr om correctors. Our approach is to apply the predictor-corrector method not only with stepsize h, but, in addition (and simultaneously) with stepsizes a i h; i = 1; : : :; r. In this way, at each step, a whole block of approximations to the exact solution at oo-step points is computed. In the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014